Near Optimal H∞ Tracking for a Compact Set of Plants
نویسندگان
چکیده
Here we consider the problem of providing near optimal performance for a large set of possible models. We adopt the H∞ framework in the single-input single-output (SISO) setting with structured uncertainty: a compact set of controllable and observable plant models of a fixed order; we consider the control problem of designing a controller to minimize the worst case performance. We consider two different feedback configurations, and under a mild assumption we prove that a linear periodic controller (LPC) exists which achieves the objective.
منابع مشابه
Optimal Observer Path Planning For Bearings-Only Moving Targets Tracking Using Chebyshev Polynomials
In this paper, an optimization problem for the observer trajectory in the bearings-only surface moving target tracking (BOT) is studied. The BOT depends directly on the observability of the target's position in the target/observer geometry or the optimal observer maneuver. Therefore, the maximum lower band of the Fisher information matrix is opted as an independent criterion of the target estim...
متن کاملMathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks
In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملAn Extended Compact Genetic Algorithm for Milk Run Problem with Time Windows and Inventory Uncertainty
In this paper, we introduce a model to optimization of milk run system that is one of VRP problem with time window and uncertainty in inventory. This approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .The problem is formulated as a robust optimization problem. Since the resulted problem illustrates that grows up ...
متن کاملCOUNTABLY NEAR PS-COMPACTNESS IN L-TOPOLOGICAL SPACES
In this paper, the concept of countably near PS-compactness inL-topological spaces is introduced, where L is a completely distributive latticewith an order-reversing involution. Countably near PS-compactness is definedfor arbitrary L-subsets and some of its fundamental properties are studied.
متن کامل